________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:43:11
Input Data from:  dataset139.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,063
Average f[i]   :4775
Average g[i,j] :2041,66666666667
Total demand   :5800
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	670	1	-1	5	4000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 670


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 69
> Selected Move:	740	1	-1	2	8500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 740


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 85
> Selected Move:	840	3	5	6	10000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 840


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 68
> Selected Move:	1200	1	-1	9	14000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1200


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 82
> Selected Move:	1570	1	-1	10	20000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0    >new incumb.: 1570


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 71
> Selected Move:	1960	1	-1	16	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0    >new incumb.: 1960


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 64
> Selected Move:	1960	3	10	13	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 48
> Selected Move:	1960	3	13	15	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 47
> Selected Move:	1860	3	2	5	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 42
> Selected Move:	1980	3	6	10	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  0  0  1  1  0  0  0    >new incumb.: 1980


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 54
> Selected Move:	1990	3	15	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  1  0  0  1  0  0  0    >new incumb.: 1990


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 57
> Selected Move:	1860	3	10	6	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 55
> Selected Move:	1860	3	13	10	24000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 71
> Selected Move:	1810	3	5	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 88
> Selected Move:	1810	3	10	13	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 68
> Selected Move:	1800	3	6	2	24000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 66
> Selected Move:	1865	3	4	10	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 57
> Selected Move:	1858	3	13	15	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 57
> Selected Move:	1900	3	16	18	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 67
> Selected Move:	1840	3	15	13	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 76
> Selected Move:	1760	3	2	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 78
> Selected Move:	1740	3	9	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 72
> Selected Move:	1740	3	13	15	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 74
> Selected Move:	1800	3	16	9	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 77
> Selected Move:	1880	3	18	4	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 46
> Selected Move:	1820	3	15	13	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 55
> Selected Move:	1740	3	4	18	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 85
> Selected Move:	1750	3	10	15	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 68
> Selected Move:	1785	3	18	16	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 54
> Selected Move:	1720	3	13	17	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 65
> Selected Move:	1720	3	15	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 77
> Selected Move:	1820	3	5	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 81
> Selected Move:	1800	3	17	4	23500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 75
> Selected Move:	1810	3	0	6	25000


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 57
> Selected Move:	1890	3	4	5	24500


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 56
> Selected Move:	2020	3	6	13	24800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  1  0  0  2  0  0  1  0  0  0    >new incumb.: 2020


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 63
> Selected Move:	1975	3	13	15	25100


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  1  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 58
> Selected Move:	1890	3	10	6	24600


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  0  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 48
> Selected Move:	1890	4	15	6	25000


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 42
> Selected Move:	1910	3	6	13	25300


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  0  0  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 48
> Selected Move:	1890	3	15	6	24300


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  0  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 63
> Selected Move:	1890	4	13	6	25000


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 52
> Selected Move:	1818	3	6	15	25600


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  0  0  0  1  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 55
> Selected Move:	1768	3	15	10	25800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  2  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 57
> Selected Move:	1890	3	13	6	24800


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  2  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 64
> Selected Move:	1810	3	2	4	24800


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  0  1  2  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 66
> Selected Move:	1810	4	10	6	24500


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 83
> Selected Move:	1840	3	6	13	24800


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 76
> Selected Move:	1850	3	16	2	24800


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  1  0  0  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 60
> Selected Move:	1882	3	13	15	25100


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  1  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 53
> Selected Move:	1830	3	4	18	24600


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  1  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 83
> Selected Move:	1770	3	15	13	24300


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  1  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 84
> Selected Move:	1794	3	18	6	25800


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  1  0  0  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 56
> Selected Move:	1788	3	2	16	25800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 72
> Selected Move:	1810	3	10	4	24300


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  0  1  0  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 78
> Selected Move:	1810	4	13	6	25000


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 76
> Selected Move:	1800	3	13	15	25000


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 66
> Selected Move:	1800	4	6	15	24600


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  0  1  0  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 77
> Selected Move:	1786	3	6	10	25100


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  1  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 77
> Selected Move:	1750	3	16	18	24600


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  1  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 84
> Selected Move:	1772	3	4	6	25600


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  1  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 83
> Selected Move:	1823	3	18	2	26100


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  1  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 62 #######################


> Neighbours evaluated; 55
> Selected Move:	1790	2	2	-1	21600


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  1  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 63 #######################


> Neighbours evaluated; 77
> Selected Move:	1830	3	6	13	22600


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 64 #######################


> Neighbours evaluated; 76
> Selected Move:	1830	4	15	10	23300


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  2  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 65 #######################


> Neighbours evaluated; 70
> Selected Move:	1830	4	10	13	22300


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 66 #######################


> Neighbours evaluated; 79
> Selected Move:	1830	3	5	2	22800


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 67 #######################


> Neighbours evaluated; 70
> Selected Move:	1830	4	13	10	23800


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  2  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 68 #######################


> Neighbours evaluated; 59
> Selected Move:	1830	4	10	15	23100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  1  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 69 #######################


> Neighbours evaluated; 70
> Selected Move:	1820	3	9	6	24600


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 70 #######################


> Neighbours evaluated; 61
> Selected Move:	1820	4	15	6	25000


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 71 #######################


> Neighbours evaluated; 59
> Selected Move:	1820	4	6	13	24300


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 72 #######################


> Neighbours evaluated; 62
> Selected Move:	1820	3	2	5	23800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  0  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 73 #######################


> Neighbours evaluated; 72
> Selected Move:	1820	4	13	6	24500


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 74 #######################


> Neighbours evaluated; 63
> Selected Move:	1820	4	6	10	24800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  0  2  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 75 #######################


> Neighbours evaluated; 60
> Selected Move:	1820	4	10	15	24100


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  0  1  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 76 #######################


> Neighbours evaluated; 88
> Selected Move:	1790	3	10	9	22100


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  0  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 77 #######################


> Neighbours evaluated; 81
> Selected Move:	1790	4	15	5	24700


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 78 #######################


> Neighbours evaluated; 63
> Selected Move:	1800	3	6	10	25200


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  0  1  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 79 #######################


> Neighbours evaluated; 59
> Selected Move:	1830	3	5	0	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 80 #######################


> Neighbours evaluated; 90
> Selected Move:	1820	3	9	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 81 #######################


> Neighbours evaluated; 96
> Selected Move:	1790	3	10	9	22500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 82 #######################


> Neighbours evaluated; 86
> Selected Move:	1830	1	-1	2	27000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 83 #######################


> Neighbours evaluated; 53
> Selected Move:	1955	3	6	16	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 84 #######################


> Neighbours evaluated; 92
> Selected Move:	1820	3	2	10	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 85 #######################


> Neighbours evaluated; 93
> Selected Move:	1828	3	15	6	26500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 86 #######################


> Neighbours evaluated; 103
> Selected Move:	1900	3	16	2	26500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 87 #######################


> Neighbours evaluated; 72
> Selected Move:	1953	3	13	15	26500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 88 #######################


> Neighbours evaluated; 61
> Selected Move:	1915	3	6	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 89 #######################


> Neighbours evaluated; 71
> Selected Move:	1853	3	15	13	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 90 #######################


> Neighbours evaluated; 77
> Selected Move:	1790	3	10	15	26000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,145

## ITERATION 91 #######################


> Neighbours evaluated; 57
> Selected Move:	1800	3	13	16	24000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,15

## ITERATION 92 #######################


> Neighbours evaluated; 78
> Selected Move:	1800	3	2	6	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 93 #######################


> Neighbours evaluated; 93
> Selected Move:	1770	3	15	2	23000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 94 #######################


> Neighbours evaluated; 85
> Selected Move:	1810	3	0	13	24800


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  0  1  0  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 95 #######################


> Neighbours evaluated; 86
> Selected Move:	1791	3	6	10	25300


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  1  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 96 #######################


> Neighbours evaluated; 86
> Selected Move:	1799	3	9	5	25300


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 97 #######################


> Neighbours evaluated; 74
> Selected Move:	1783	3	4	6	26300


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  0  1  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 98 #######################


> Neighbours evaluated; 76
> Selected Move:	1770	3	6	18	24800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  0  1  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 99 #######################


> Neighbours evaluated; 91
> Selected Move:	1760	3	2	9	24300


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 100 #######################


> Neighbours evaluated; 103
> Selected Move:	1796	3	18	15	26800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 101 #######################


> Neighbours evaluated; 74
> Selected Move:	1760	2	9	-1	22800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  1  0  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 102 #######################


> Neighbours evaluated; 91
> Selected Move:	1760	4	13	10	23800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  2  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 103 #######################


> Neighbours evaluated; 86
> Selected Move:	1760	4	10	15	23100


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  1  0  0  1  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 104 #######################


> Neighbours evaluated; 89
> Selected Move:	1784	1	-1	9	27100


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  0  1  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 105 #######################


> Neighbours evaluated; 75
> Selected Move:	1789	3	13	6	26100


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  1  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 106 #######################


> Neighbours evaluated; 80
> Selected Move:	1803	3	16	4	26100


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  0  1  1  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 107 #######################


> Neighbours evaluated; 71
> Selected Move:	1728	4	15	6	26500


> New Y[]: 
	
	 0  3  0  0  1  1  2  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 108 #######################


> Neighbours evaluated; 62
> Selected Move:	1800	3	4	2	26500


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 109 #######################


> Neighbours evaluated; 59
> Selected Move:	1790	2	2	-1	22000


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 110 #######################


> Neighbours evaluated; 84
> Selected Move:	1790	4	6	5	24200


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 111 #######################


> Neighbours evaluated; 70
> Selected Move:	1790	4	5	9	24400


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  2  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 112 #######################


> Neighbours evaluated; 67
> Selected Move:	1790	4	9	10	22300


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  2  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 113 #######################


> Neighbours evaluated; 86
> Selected Move:	1790	3	5	2	22800


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  2  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 114 #######################


> Neighbours evaluated; 77
> Selected Move:	1790	4	10	2	24200


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 115 #######################


> Neighbours evaluated; 62
> Selected Move:	1790	4	2	6	22500


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 116 #######################


> Neighbours evaluated; 75
> Selected Move:	1790	4	6	9	24900


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  2  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 117 #######################


> Neighbours evaluated; 56
> Selected Move:	1790	4	9	15	22100


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  1  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 118 #######################


> Neighbours evaluated; 80
> Selected Move:	1790	3	10	13	22600


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  0  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 119 #######################


> Neighbours evaluated; 70
> Selected Move:	1790	4	15	2	24700


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 120 #######################


> Neighbours evaluated; 55
> Selected Move:	1794	3	6	10	25200


> New Y[]: 
	
	 0  3  2  0  0  0  0  0  0  1  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 121 #######################


> Neighbours evaluated; 67
> Selected Move:	1710	3	13	5	22700


> New Y[]: 
	
	 0  3  2  0  0  1  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 122 #######################


> Neighbours evaluated; 63
> Selected Move:	1710	4	2	5	23200


> New Y[]: 
	
	 0  3  1  0  0  2  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 123 #######################


> Neighbours evaluated; 58
> Selected Move:	1780	3	5	0	21000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 124 #######################


> Neighbours evaluated; 71
> Selected Move:	1790	3	2	6	22000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 125 #######################


> Neighbours evaluated; 91
> Selected Move:	1885	1	-1	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,15

## ITERATION 126 #######################


> Neighbours evaluated; 66
> Selected Move:	1830	3	15	13	26000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 127 #######################


> Neighbours evaluated; 78
> Selected Move:	1773	3	10	15	26500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,14

## ITERATION 128 #######################


> Neighbours evaluated; 55
> Selected Move:	1790	4	0	6	22500


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 129 #######################


> Neighbours evaluated; 79
> Selected Move:	1790	4	6	9	24900


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  2  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 130 #######################


> Neighbours evaluated; 63
> Selected Move:	1790	4	9	13	21800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  0  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 131 #######################


> Neighbours evaluated; 81
> Selected Move:	1858	1	-1	2	26300


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  0  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 132 #######################


> Neighbours evaluated; 58
> Selected Move:	1854	3	2	10	27800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 133 #######################


> Neighbours evaluated; 71
> Selected Move:	1828	3	10	4	26300


> New Y[]: 
	
	 0  3  0  0  1  1  1  0  0  1  0  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 134 #######################


> Neighbours evaluated; 70
> Selected Move:	1821	3	6	2	25300


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  0  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 135 #######################


> Neighbours evaluated; 58
> Selected Move:	1802	3	13	10	25800


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  2  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,14

## ITERATION 136 #######################


> Neighbours evaluated; 59
> Selected Move:	1898	3	4	16	25800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  2  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 137 #######################


> Neighbours evaluated; 83
> Selected Move:	1809	3	16	6	26800


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  2  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,15

## ITERATION 138 #######################


> Neighbours evaluated; 60
> Selected Move:	1785	3	6	18	25300


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  2  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 139 #######################


> Neighbours evaluated; 92
> Selected Move:	1780	3	10	13	24800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  0  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 140 #######################


> Neighbours evaluated; 87
> Selected Move:	1782	3	2	6	25800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  0  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 141 #######################


> Neighbours evaluated; 87
> Selected Move:	1756	3	18	16	26300


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  0  0  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 142 #######################


> Neighbours evaluated; 74
> Selected Move:	1759	3	6	4	25300


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  0  0  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 143 #######################


> Neighbours evaluated; 78
> Selected Move:	1750	3	16	18	24800


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  0  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 144 #######################


> Neighbours evaluated; 87
> Selected Move:	1732	4	13	15	25100


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  0  0  0  1  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 145 #######################


> Neighbours evaluated; 88
> Selected Move:	1762	3	4	2	25100


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  0  0  0  1  0  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,19

## ITERATION 146 #######################


> Neighbours evaluated; 86
> Selected Move:	1746	3	18	4	25600


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  0  0  0  1  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 147 #######################


> Neighbours evaluated; 59
> Selected Move:	1730	3	13	16	23600


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  0  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 148 #######################


> Neighbours evaluated; 74
> Selected Move:	1780	3	5	6	25100


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  0  1  0  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 149 #######################


> Neighbours evaluated; 73
> Selected Move:	1749	3	15	10	25300


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  0  1  2  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 150 #######################


> Neighbours evaluated; 83
> Selected Move:	1730	3	4	18	24800


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  2  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 151 #######################


> Neighbours evaluated; 95
> Selected Move:	1730	4	10	6	24500


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  1  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 152 #######################


> Neighbours evaluated; 100
> Selected Move:	1760	3	6	13	24800


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  1  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 153 #######################


> Neighbours evaluated; 94
> Selected Move:	1730	3	10	6	24300


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  0  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 154 #######################


> Neighbours evaluated; 94
> Selected Move:	1730	4	13	6	25000


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  1  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 155 #######################


> Neighbours evaluated; 95
> Selected Move:	1730	3	2	5	24500


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 156 #######################


> Neighbours evaluated; 94
> Selected Move:	1730	4	6	13	23800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  0  0  0  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 157 #######################


> Neighbours evaluated; 102
> Selected Move:	1730	3	6	15	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  0  0  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 158 #######################


> Neighbours evaluated; 93
> Selected Move:	1720	3	13	6	24500


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 159 #######################


> Neighbours evaluated; 91
> Selected Move:	1730	3	15	10	24000


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 160 #######################


> Neighbours evaluated; 107
> Selected Move:	1730	4	6	10	24300


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  2  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 161 #######################


> Neighbours evaluated; 106
> Selected Move:	1720	3	10	15	24100


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  1  0  0  0  0  0  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 96
> Selected Move:	1730	3	6	10	24600


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  0  0  0  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 163 #######################


> Neighbours evaluated; 100
> Selected Move:	1752	3	9	2	25100


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  0  1  0  0  0  0  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 164 #######################


> Neighbours evaluated; 96
> Selected Move:	1742	3	18	4	25600


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  0  1  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 165 #######################


> Neighbours evaluated; 75
> Selected Move:	1730	3	4	6	26600


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  0  1  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 166 #######################


> Neighbours evaluated; 78
> Selected Move:	1703	3	10	4	25100


> New Y[]: 
	
	 0  3  1  0  1  1  1  0  0  0  0  0  0  0  0  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 167 #######################


> Neighbours evaluated; 71
> Selected Move:	1720	3	15	13	24800


> New Y[]: 
	
	 0  3  1  0  1  1  1  0  0  0  0  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 168 #######################


> Neighbours evaluated; 74
> Selected Move:	1730	3	6	9	23300


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  0  0  0  2  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 169 #######################


> Neighbours evaluated; 76
> Selected Move:	1750	3	4	17	24800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  0  0  0  2  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 170 #######################


> Neighbours evaluated; 93
> Selected Move:	1735	3	13	15	25100


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  0  0  0  0  0  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 171 #######################


> Neighbours evaluated; 85
> Selected Move:	1720	3	15	6	24500


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 172 #######################


> Neighbours evaluated; 89
> Selected Move:	1720	4	6	17	24300


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  0  0  0  0  0  0  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 173 #######################


> Neighbours evaluated; 92
> Selected Move:	1750	3	6	10	24800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  1  0  0  0  0  0  1  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 174 #######################


> Neighbours evaluated; 95
> Selected Move:	1702	4	17	10	25300


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  2  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 175 #######################


> Neighbours evaluated; 90
> Selected Move:	1730	3	17	4	23800


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  2  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 176 #######################


> Neighbours evaluated; 86
> Selected Move:	1730	4	10	16	24700


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  0  1  1  0  0  0  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 177 #######################


> Neighbours evaluated; 74
> Selected Move:	1789	3	4	6	25700


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  0  1  1  0  0  0  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 178 #######################


> Neighbours evaluated; 83
> Selected Move:	1782	3	6	13	26700


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  1  0  0  1  0  0  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,135

## ITERATION 179 #######################


> Neighbours evaluated; 77
> Selected Move:	1808	3	16	6	26500


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 180 #######################


> Neighbours evaluated; 69
> Selected Move:	1790	3	2	16	26500


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 181 #######################


> Neighbours evaluated; 84
> Selected Move:	1753	3	13	15	26500


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 182 #######################


> Neighbours evaluated; 82
> Selected Move:	1760	3	16	18	26000


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  0  1  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 183 #######################


> Neighbours evaluated; 87
> Selected Move:	1749	3	6	13	26300


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  1  0  0  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 184 #######################


> Neighbours evaluated; 82
> Selected Move:	1742	3	18	4	26800


> New Y[]: 
	
	 0  3  0  0  1  1  0  0  0  1  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 185 #######################


> Neighbours evaluated; 62
> Selected Move:	1723	3	4	2	26800


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  1  1  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 186 #######################


> Neighbours evaluated; 58
> Selected Move:	1780	3	13	0	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 187 #######################


> Neighbours evaluated; 50
> Selected Move:	1768	3	5	3	26500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 188 #######################


> Neighbours evaluated; 55
> Selected Move:	1750	3	2	5	26000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 189 #######################


> Neighbours evaluated; 57
> Selected Move:	1720	3	15	6	25000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 190 #######################


> Neighbours evaluated; 63
> Selected Move:	1725	3	5	2	25500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 191 #######################


> Neighbours evaluated; 58
> Selected Move:	1770	3	3	4	24500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 192 #######################


> Neighbours evaluated; 74
> Selected Move:	1790	3	9	16	25000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 193 #######################


> Neighbours evaluated; 87
> Selected Move:	1715	3	6	13	26000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 194 #######################


> Neighbours evaluated; 77
> Selected Move:	1735	3	2	9	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 195 #######################


> Neighbours evaluated; 83
> Selected Move:	1713	3	9	5	25500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 196 #######################


> Neighbours evaluated; 76
> Selected Move:	1710	3	13	15	25500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,225

## ITERATION 197 #######################


> Neighbours evaluated; 78
> Selected Move:	1700	3	10	9	23500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 198 #######################


> Neighbours evaluated; 80
> Selected Move:	1715	3	16	13	25500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 199 #######################


> Neighbours evaluated; 56
> Selected Move:	1700	3	15	16	23500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 200 #######################


> Neighbours evaluated; 75
> Selected Move:	1720	3	4	17	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 201 #######################


> Neighbours evaluated; 84
> Selected Move:	1698	3	5	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 202 #######################


> Neighbours evaluated; 83
> Selected Move:	1790	3	13	6	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 203 #######################


> Neighbours evaluated; 90
> Selected Move:	1693	3	6	15	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 204 #######################


> Neighbours evaluated; 78
> Selected Move:	1720	3	17	18	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 205 #######################


> Neighbours evaluated; 98
> Selected Move:	1730	3	2	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 206 #######################


> Neighbours evaluated; 98
> Selected Move:	1750	3	16	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 207 #######################


> Neighbours evaluated; 100
> Selected Move:	1683	3	18	16	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 208 #######################


> Neighbours evaluated; 76
> Selected Move:	1700	3	15	5	23000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 209 #######################


> Neighbours evaluated; 81
> Selected Move:	1700	3	1	13	25000


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  1  1  0  0  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 210 #######################


> Neighbours evaluated; 43
> Selected Move:	1700	3	13	15	24900


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  1  1  0  0  0  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 211 #######################


> Neighbours evaluated; 40
> Selected Move:	1706	3	5	2	25400


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  1  0  0  0  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,23

## ITERATION 212 #######################


> Neighbours evaluated; 43
> Selected Move:	1770	3	10	6	24900


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  0  1  0  0  0  0  0  3  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,225

## ITERATION 213 #######################


> Neighbours evaluated; 29
> Selected Move:	1770	3	15	10	25000


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  0  1  3  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 214 #######################


> Neighbours evaluated; 47
> Selected Move:	1770	3	10	13	25000


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  0  1  0  0  0  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 215 #######################


> Neighbours evaluated; 39
> Selected Move:	1693	3	6	10	25500


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  1  0  0  3  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 216 #######################


> Neighbours evaluated; 42
> Selected Move:	1720	3	4	18	25000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  1  0  0  3  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 217 #######################


> Neighbours evaluated; 79
> Selected Move:	1720	3	13	1	23000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 218 #######################


> Neighbours evaluated; 107
> Selected Move:	1740	3	9	13	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 219 #######################


> Neighbours evaluated; 96
> Selected Move:	1743	3	13	15	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,19

## ITERATION 220 #######################


> Neighbours evaluated; 99
> Selected Move:	1730	3	18	4	26000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 221 #######################


> Neighbours evaluated; 81
> Selected Move:	1720	2	4	-1	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,19

## ITERATION 222 #######################


> Neighbours evaluated; 77
> Selected Move:	1770	3	16	6	22500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 223 #######################


> Neighbours evaluated; 78
> Selected Move:	1720	3	1	13	24500


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  0  0  1  0  0  3  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 224 #######################


> Neighbours evaluated; 34
> Selected Move:	1720	4	13	10	25000


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  0  0  3  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 225 #######################


> Neighbours evaluated; 31
> Selected Move:	1720	4	10	15	24400


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  0  0  1  0  0  1  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 226 #######################


> Neighbours evaluated; 41
> Selected Move:	1720	3	6	9	22900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  1  0  0  1  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 227 #######################


> Neighbours evaluated; 49
> Selected Move:	1720	4	15	10	23500


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  3  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 > pw :0,16

## ITERATION 228 #######################


> Neighbours evaluated; 40
> Selected Move:	1730	3	10	1	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,155

## ITERATION 229 #######################


> Neighbours evaluated; 57
> Selected Move:	1790	3	0	6	23000


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  0  1  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 230 #######################


> Neighbours evaluated; 67
> Selected Move:	1790	4	6	13	22300


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  1  0  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 231 #######################


> Neighbours evaluated; 76
> Selected Move:	1732	4	13	9	25400


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  2  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 232 #######################


> Neighbours evaluated; 66
> Selected Move:	1778	3	9	10	25300


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  2  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 233 #######################


> Neighbours evaluated; 71
> Selected Move:	1760	3	6	16	24300


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  2  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 234 #######################


> Neighbours evaluated; 85
> Selected Move:	1760	4	10	13	23300


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  1  0  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 235 #######################


> Neighbours evaluated; 86
> Selected Move:	1833	1	-1	9	27300


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  1  0  0  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12
________________________________________________________________

Best solution found: 2020
Run Termination time: 31.01.2010 10:45:17
Run duration: 00:02:05.6406250
________________________________________________________________
